Optimal Power Allocation for Cooperative Multiple Access With Non-Ideal Full-Duplex Sources

This paper considers a cooperative multiple access (CMA) scheme where two full-duplex sources simultaneously send their own messages to common destination. As part of cooperation, each the also receives and relays message from other source. develops algorithms for computing optimal power allocation achieve maximal network throughput subject residual self-interference (RSI) at non-ideal sources. generalization time-division duplex (TDD) scheme, we consider three-phase CMA (3P-CMA) which treats TDD as special case. The 3P-CMA consistently exceeds that regardless RSI gain. Also shown in this is semi-closed form when three-phases are constrained be identical, i.e., resulting one-phase (1P-CMA) scheme. 1P-CMA takes much less time compute, its throughout close gain low.